Method and apparatus for estimating a signal sequence in a MIMO-OFDM mobile communication system

ABSTRACT

A apparatus and method for estimating a sequence of transmitted quadrature amplitude modulation (QAM)-modulated signals and space-time block coded signals using an optimal expectation-maximization (EM)-based iterative estimation algorithm in a multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) mobile communication system. An initial sequence estimation value is produced on the basis of a predetermined initial value using a pilot sub-carrier contained in each of OFDM signals received by a receiving side. A normalized value of a received signal on a channel-by-channel basis is produced by a predetermined equation using orthogonality between the OFDM signals received by the receiving side. At least one subsequent sequence estimation value is produced using the initial sequence estimation value and the normalized value of the received signal on the channel-by-channel basis. If the subsequent sequence estimation value converges to a constant value after an operation of producing the subsequent sequence estimation value is iterated the predetermined number of times, the converged subsequent sequence estimation value is designated as a final sequence estimation value.

PRIORITY

[0001] This application claims priority to an application entitled “METHOD AND APPARATUS FOR ESTIMATING SIGNAL SEQUENCE IN MIMO-OFDM MOBILE COMMUNICATION SYSTEM”, filed in the Korean Industrial Property Office on Apr. 21, 2003 and assigned Serial No. 2003-25146, the contents of which are hereby incorporated by reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The present invention relates generally to a mobile communication system based on an orthogonal frequency division multiplexing (OFDM), and more particularly to a method for estimating sequences of OFDM signals transmitted after quadrature amplitude modulation (QAM) and space-time block code (STBC) encoding operations are performed.

[0004] 2. Description of the Related Art

[0005] It is difficult for 3G code division multiple access (CDMA) mobile communication systems to process large-capacity radio data. To overcome this difficulty, 4G orthogonal frequency division multiplexing (OFDM) mobile communication systems capable of processing large-capacity data on a multipath channel at a high speed have been proposed.

[0006] Conventionally, when data is transmitted over an orthogonal frequency division multiplexing (OFDM) system, sub-carriers carry symbols and then sub-channels combined with the sub-carriers are transmitted. Because spectrums of the sub-channels in the OFDM system can maintain the orthogonality with each other, and overlap each other, the efficiency of the spectrums is good. Because OFDM modulation and demodulation are implemented by an inverse Fourier fast transform (IFFT) and fast Fourier transform (FFT), a modulator/demodulator can be efficiently digitalized. Further, the OFDM system can efficiently operate in a current European digital broadcasting system, not affected by frequency-selective fading or narrow-band interference environments, and can also operate in a high-speed data transmission system based on standards of large-capacity wireless communication systems adopted by IEEE 802.11a, IEEE 802.16a, IEEE 802.16b, etc. Further, as the demand for broadband wireless communications increases in 4G mobile communication systems, research is currently being carried out on multiple-input and multiple-output (MIMO) systems using multiple antennas when transmitting and receiving operations are ongoing. In the MIMO systems, a decoding process uses a space-time block code (STBC), which is relatively uncomplicated.

[0007]FIG. 1 is a schematic diagram illustrating a conventional MIMO-OFDM transmission system. Referring to FIG. 1, data symbols to be transmitted by a transmitting side are modulated by a modulator (not shown). At this time, typical modulation schemes include quadrature phase shift keying (QPSK), 16-quadrature amplitude modulation (QAM), 64-QAM, etc. The above-described modulated symbols are input into an STBC encoder 110. The STBC encoder 110 carries out a space-time block encoding operation for the input modulated symbols. Then, outputs of the STBC encoder 110 are input into inverse Fourier fast transform (IFFT) processors 120, 121, . . . , 122. The IFFT processors 120, 121, . . . , 122 convert the outputs of the STBC encoder 110 into OFDM signals according to IFFT operations. Finally, the OFDM signals are transmitted through a plurality of transmitting antennas 130, 131, . . . , 132.

[0008]FIG. 2 is a schematic diagram illustrating a conventional MIMO-OFDM reception system. Referring to FIG. 2, a plurality of receiving antennas 201, 202, . . . , 203 receive OFDM signals. FFT processors 210, 211, . . . , 212 perform Fourier fast transform (FFT) operations for the received OFDM signals to generate FFT operation signals. A pilot detection and initial value estimation unit 220 produces an initial sequence estimation value using a pilot sub-carrier contained in each of the OFDM signals detected from the FFT operation signals and a predetermined initial value. Outputs of the pilot detection and initial value estimation unit 220 and FFT processors 210, 211, . . . , 212 are input into an STBC decoder 230. The STBC decoder 230 determines an optimum received signal and performs a space-time block decoding operation.

[0009] Methods for estimating the channel of a received signal in the OFDM system may include a deterministic maximum likelihood (ML) estimation method, a minimum mean square error (MMSE) estimation method, etc.

[0010] It is assumed that a channel impulse response is unknown but can be determined (not random) using the deterministic ML estimation method. The deterministic ML estimation method estimates the channel by obtaining an estimation value of the optimum ML. However, the deterministic ML estimation method has a problem in that the accuracy of estimation is degraded because previous channel information statistical channel information is not used when the channel of a received signal is estimated. It is assumed that the channel impulse response is random in the MMSE estimation method. The MMSE estimation method estimates the channel such that the square of a channel estimation error value can be minimized. However, the MMSE estimation method has a problem in that it is difficult for the MMSE estimation method to be implemented in an actual system because statistical data associated with channel characteristics, signal-to-noise ratio (SNR) data, etc. are needed so that the channel of the received signal can be estimated.

[0011] As a result, the receiving side of the conventional MIMO-OFDM system needs an improved channel estimation method capable of compensating for the distortion of a signal due to multipath fading such that a QAM-modulated and space-time block coded signal can be appropriately detected.

SUMMARY OF THE INVENTION

[0012] Accordingly, the present invention has been designed in view of the above and other problems, and it is an object of the present invention to provide a method based on an optimal expectation-maximization (EM)-based iterative estimation algorithm for compensating for the distortion of a signal due to multipath fading when a receiving side of a multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) system appropriately detects a transmitted quadrature amplitude modulation (QAM)-modulated and space-time block coded signal.

[0013] It is another object of the present invention to provide a method capable of estimating a signal sequence without producing an inverse matrix associated with a sequence estimation value at each iteration time by employing a normalized value of a received signal on a channel-by-channel basis when the signal sequence is estimated on a basis of an expectation-maximization (EM)-based iterative estimation algorithm

[0014] In accordance with an aspect of the present invention, the above and other objects can be accomplished by a method for estimating a sequence of transmitted quadrature amplitude modulation (QAM)-modulated and space-time block coded signals using an optimal expectation-maximization (EM)-based iterative estimation algorithm in a multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) mobile communication system, comprising the steps of (a) producing an initial sequence estimation value according to a predetermined initial value using a pilot sub-carrier contained in each of OFDM signals received by a receiving side; (b) producing a normalized value of a received signal on a channel-by-channel basis using orthogonality between the OFDM signals received by the receiving side and a predetermined equation; (c) producing at least one subsequent sequence estimation value using the initial sequence estimation value and the normalized value of the received signal on the channel-by-channel basis; and (d) if the at least one subsequent sequence estimation value converges to a constant value after producing the subsequent sequence estimation value is iterated a predetermined number of times, determining the converged subsequent sequence estimation value to be a final sequence estimation value.

BRIEF DESCRIPTION OF THE DRAWINGS

[0015] The above and other objects, features, and advantages of the present invention will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings, in which:

[0016]FIG. 1 is a schematic diagram illustrating a conventional multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) transmission system;

[0017]FIG. 2 is a schematic diagram illustrating a conventional MIMO-OFDM reception system;

[0018]FIG. 3 is a schematic diagram illustrating a MIMO-OFDM reception system in accordance with a first embodiment of the present invention;

[0019]FIG. 4 is a flow chart illustrating a method for estimating a sequence of QAM-modulated signals on a receiving side of a MIMO-OFDM system in accordance with the first embodiment of the present invention;

[0020]FIG. 5 is a graph illustrating a bit error rate (BER) performance when a space-time block code based on a rate 1 for two transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention;

[0021]FIG. 6 is a graph illustrating the BER performance when a space-time block code based on a rate ¾ for three transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention;

[0022]FIG. 7 is a graph illustrating the BER performance when a space-time block code based on a rate ¾ for four transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention;

[0023]FIG. 8 is a graph illustrating the mean squared error (MSE) performance when a space-time block code based on a rate 1 for two transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention;

[0024]FIG. 9 is a graph illustrating the MSE performance when a space-time block code based on a rate ¾ for four transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention;

[0025]FIG. 10 is a block diagram illustrating a MIMO-OFDM reception system in accordance with a second embodiment of the present invention;

[0026]FIG. 11 is a flow chart illustrating a method for estimating a sequence of QAM-modulated signals through one receiving antenna of a MIMO-OFDM system in accordance with the second embodiment of the present invention;

[0027]FIG. 12 is a graph illustrating the BER performance based on a method for detecting a received signal in the case of 16-QAM in accordance with the second embodiment of the present invention;

[0028]FIG. 13 is a graph illustrating the BER performance based on a method for detecting a received signal in the case of 64-QAM in accordance with the second embodiment of the present invention;

[0029]FIG. 14 is a graph illustrating an improved MSE performance based on an iterative procedure in accordance with the second embodiment of the present invention; and

[0030]FIG. 15 is a graph illustrating an improved average MSE performance based on an iterative procedure in accordance with the second embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0031] Preferred embodiments of the present invention will be described in detail herein below with reference to the annexed drawings. In the drawings, the same or similar elements are denoted by the same reference numerals even though they are depicted in different drawings. In the following description made in conjunction with preferred embodiments of the present invention, a variety of specific elements such as concrete circuits are illustrated. The description of such elements has been made only for a better understanding of the present invention. Those skilled in the art will appreciate that the present invention can be implemented without using the above-described specific elements. Also, in the following description, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear.

[0032] First Embodiment

[0033] The first embodiment of the present invention uses an optimal expectation-maximization (EM)-based iterative estimation algorithm to compensate for distortion of a signal caused by multi-path fading when a receiving side of a multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) mobile communication system in accordance with the first embodiment of the present invention (FIG. 3) estimates a sequence of transmitted quadrature amplitude modulation (QAM)-modulated signals and space-time block coded signals. The present invention proposes a method for estimating a signal sequence without producing an inverse matrix associated with a sequence estimation value at each iteration time by employing a normalized value of a received signal on a channel-by-channel basis when the signal sequence is estimated using the EM-based iterative estimation algorithm.

[0034] Before the first embodiment of the present invention is described in detail, a method for estimating the signal sequence using an EM-based iterative estimation algorithm for transmitted QAM-modulated signals and space-time block coded signals in the receiving side of the MIMO-OFDM mobile communication system will be described.

[0035] First, a number of transmitting antennas is “N”, a number of receiving antennas is “M”, a length of a code word is “L”, and a number of sub-carriers for OFDM signals is “N_(s)”. Further, a number of sub-carriers to be used for modulation is $\begin{matrix} {P = {{2N_{\alpha}} + {1\left( {N_{\alpha} = {{int}\quad\left\lbrack \frac{N\left( {1 - \alpha} \right)}{2} \right\rbrack}} \right)}}} & \quad \end{matrix}$

[0036] where “int[^(·)]” denotes an integer part of a result of the operation within the bracket. Furthermore, a p^(th) transmission data symbol vector is given by s_(p)=[s_(p)(−N_(α)), . . . s_(p)(−1), s_(p)(0), s_(p)(1), . . . s_(p)(N_(α))]^(T) where “[^(·)]^(T)” denotes a vector transpose operation. Space-time block coding associated with the p^(th) transmission data symbol vector can be represented by Equation 1. $\begin{matrix} {C_{p} = \begin{bmatrix} {c_{1}^{p}(1)} & {c_{2}^{p}(1)} & \cdots & {c_{N}^{p}(1)} \\ {c_{1}^{p}(2)} & {c_{2}^{p}(2)} & \cdots & {c_{N}^{p}(2)} \\ \quad & {\quad \cdots} & \quad & \quad \\ {c_{1}^{p}(L)} & {c_{2}^{p}(L)} & \cdots & {c_{N}^{p}(L)} \end{bmatrix}} & {{Equation}\quad 1} \end{matrix}$

[0037] In Equation 1 above, “c_(n) ^(P)(l)” denotes an l^(th) symbol of a p^(th) code word transmitted by an n^(th) transmitting antenna.

[0038] Transmission data symbol vectors s₁, s₂, . . . , s_(p) to be contained in a space-time block coded OFDM word are encoded to STBCs C₁, C₂, . . . , C_(p), and each code word is modulated on each sub-carrier. If this is done, a symbol D_(n)(l) to be contained in an l^(th) OFDM signal transmitted by an n^(th) transmitting antenna is given by Equation 2.

D _(n)(l)=diag[c _(n) ¹(l), c _(n) ²(l), . . . , c _(n) ^(P)(l)]  Equation 2

[0039] Thus, an l^(th) received signal y_(m)(l)=[y_(m) ¹(l), y_(m) ²(l), . . . , y_(m) ^(P)(l)]^(T) from an m^(th) receiving antenna is expressed as in Equation 3. $\begin{matrix} {{y_{m}(l)} = {{\sum\limits_{n = 1}^{N}{{D_{n}(l)}{H_{n,m}(l)}}} + {n_{m}(l)}}} & {{Equation}\quad 3} \end{matrix}$

[0040] In Equation 3 above, “D_(n)(l)” denotes a symbol contained in an OFDM signal transmitted from the n^(th) transmitting antenna “n_(m)(l)” denotes an additive white Gaussian noise (AWGN) vector and an average of vectors is zero. “n_(m)(l)” is associated with a covariance matrix of “σ_(n) ²I” where “σ_(n) ²” denotes a noise variable and “I” denotes an identity matrix. H_(n,m)(l)=[H_(n,m) ¹(l), H_(n,m) ²m (l), . . . , H_(n,m) ^(P)(l)]^(T) denotes a frequency response associated with a channel from the n^(th) transmitting antenna to the m^(th) receiving antenna, and is expressed in Equation 4.

H _(n,m)(l)=Fh _(n,m)(l)=[f ¹ f ² . . . f ^(P)]^(T) h _(n,m)(l)  Equation 4

[0041] In Equation 4, h_(n,m)(l)=[h_(n,m) ¹(l) h_(n,m) ²(l) . . . , h_(n,m) ^(J)(l)]^(T) denotes an impulse response associated with the channel from the n^(th) transmitting antenna to the m^(th) receiving antenna. It is assumed that h_(n,m)(l) elements have independent Rayleigh fading factors. Further, “F” denotes a discrete Fourier transform matrix whose elements are expressed as in Equation 5. $\begin{matrix} {{\left\lbrack f^{p} \right\rbrack_{a} = {\exp \quad \left( {{- j}\quad \frac{2\pi \quad {p^{\prime}\left( {a - 1} \right)}}{N_{s}}} \right)}},\quad {p = 1},2,\cdots,{{P\quad a} = 1},2,\cdots,J} & {{Equation}\quad 5} \end{matrix}$

[0042] In Equation 5, “P” denotes the number of sub-carriers, and “J” denotes the number of channel impulse response paths. Further, a sub-carrier index p′=p−N_(α)−1 , and it is satisfied that |p′|≦N_(α).

[0043] In the above case, channel fading is constant with respect to OFDM space-time code words. In other words, a channel is in quasi-static state when Equation 6 is satisfied.

H _(n,m)(1)=H _(n,m)(2)= . . . =H _(n,m)(L)=H _(n,m)  Equation 6

[0044] If Equation 6 is satisfied, Equation 3 can be expressed as in Equation 7. $\begin{matrix} {y_{m} = {{\sum\limits_{n = 1}^{N}{D_{n}H_{n,m}}} + n_{m}}} & {{Equation}\quad 7} \end{matrix}$

[0045] In Equation 7, y_(m)=[y_(m) ^(T)(1) y_(m) ^(T)(2) . . . , y_(m) ^(T)(L)]^(T) and n_(m)=[n_(m) ^(T)(1) n_(m) ^(T)(2) . . . , n_(m) ^(T)(L)]^(T).

[0046] In order for the EM-based iterative channel estimation algorithm to be applied to received signals, Equation 7 can be expressed as in Equations 8 and 9.

y _(m) =D _(m) {overscore (F)}h _(m) +n _(m)  Equation 8 $\begin{matrix} {{\overset{\_}{F} = \begin{bmatrix} F & 0 & \cdots & 0 \\ 0 & F & \cdots & 0 \\ \quad & \cdots & \quad & \quad \\ 0 & 0 & \cdots & F \end{bmatrix}},\quad {h_{m} = \left\lbrack {{h_{1,\quad m}^{T}h_{2,m}^{T}\cdots},h_{N,m}^{T}} \right\rbrack^{T}},\quad {{{and}\quad D} = \begin{bmatrix} {D_{1}(1)} & {D_{2}(1)} & \cdots & {D_{N}(1)} \\ {D_{1}(2)} & {D_{2}(2)} & \cdots & {D_{N}(2)} \\ \quad & {\quad \cdots} & \quad & \quad \\ {D_{1}(L)} & {D_{2}(L)} & \cdots & {D_{N}(L)} \end{bmatrix}}} & {{Equation}\quad 9} \end{matrix}$

[0047] The signal sequence received by the receiving side of the MIMO-OFDM mobile communication system is estimated by the EM-based iterative estimation algorithm as follows.

[0048] First, an iterated initial value, i.e., an initial sequence estimation value ŝ⁰, is produced according to a predetermined initial value using a pilot sub-carrier contained in each OFDM symbol at an initial estimation step. The predetermined initial value can be a minimum mean square error (MMSE) estimation value or deterministic maximum likelihood (ML) estimation value.

[0049] Next, a likelihood function as shown in Equation 10 is produced at an expectation step. $\begin{matrix} {{L\left( s \middle| {\hat{s}}^{i} \right)} = {\sum\limits_{m = 1}^{M}\left\{ {{{Re}\left\lbrack {y_{m}^{H}D\overset{\_}{F}\mu_{m}^{i}} \right\rbrack} - {\frac{1}{2}{\sum\limits_{a = 1}^{NJ}{\sum\limits_{b = 1}^{NJ}{\left\lbrack {\left( {D\overset{\_}{F}} \right)^{H}D\overset{\_}{F}} \right\rbrack_{a,b}\left\lbrack x_{m}^{i} \right\rbrack}_{a,b}}}}} \right\}}} & {{Equation}\quad 10} \end{matrix}$

[0050] In Equation 10, “s=[s₁ ^(T), s₂ ^(T), . . . , s_(P) ^(T)]^(T)” denotes a data symbol vector contained in one STBC-OFDM codeword and “μ_(m) ^(i)” denotes a conditional expected value for a channel impulse response where a received signal y_(m) and an i^(th) sequence estimation value ŝ^(i) are given, and is expressed as in Equation 11.

μ_(m) ^(i) =E[h _(m) |y _(m) , ŝ ^(i) ]=K _(m) ^(i) {overscore (F)} ^(H)({circumflex over (D)}^(i))^(H) y _(m)  Equation 11

[0051] In Equation 11, the notation (·)^(H) denotes a Hermitian transpose operation, and the notation “E[·]” denotes an operation for computing an average value (or expected value). Further, “{circumflex over (D)}^(i)” denotes a matrix defined as in the above Equations 2 and 9 using the i^(th) sequence estimation value. Further, “K_(m) ^(i)” denotes a normalized value of the channel impulse response, and is expressed as in Equation 12 where a covariance matrix of the channel impulse response is given by R_(m)=E[h_(m)h_(m) ^(H)]. $\begin{matrix} {K_{m}^{i} = \left( {{\sigma_{n}^{2}R_{m}^{- 1}} + {{{\overset{\_}{F}}^{H}\left( {\hat{D}}^{i} \right)}^{H}{\hat{D}}^{i}\overset{\_}{F}}} \right)^{- 1}} & {{Equation}\quad 12} \end{matrix}$

[0052] In Equation 10, “x_(m) ^(i)” denotes a conditional expected value of the covariance matrix of the channel impulse response where the received signal y_(m) and the i^(th) sequence estimation value ŝ^(i) are given, and is expressed as in Equation 13.

x ^(m) ^(i) =E[h _(m) h _(m) ^(H) |y _(m) , ŝ ^(i) ]=σ _(n) ² K _(m) ^(i)+μ_(m) ^(i)(μ_(m) ^(i))^(H)  Equation 13

[0053] Next, a (i+1)^(th) sequence estimation value, i.e., a subsequent sequence estimation value, is produced by Equation 14 at a maximization step. $\begin{matrix} {{\hat{s}}^{i + 1} = {\arg \quad {\max\limits_{s}{L\left( s \middle| {\hat{s}}^{i} \right)}}}} & {{Equation}\quad 14} \end{matrix}$

[0054] The procedure for producing the subsequent sequence estimation value is repeated until the sequence estimation value converges to a constant value.

[0055] If the sequence estimation value converges according to the above-described procedure, the converged value is determined to be a final sequence estimation value, and then a data symbol is determined according to the final sequence estimation value by STBC decoding.

[0056] When the signal sequence is estimated by the receiving side of the MIMO-OFDM mobile communication system using the conventional EM-based iterative estimation algorithm, ({circumflex over (D)}^(i))^(H) {circumflex over (D)}^(i) is previously produced and the previously produced ({circumflex over (D)}^(i))^(H) {circumflex over (D)}^(i) value is used for producing the conditional expected value μ_(m) ^(i) of the channel impulse response, because ({circumflex over (D)}^(i))^(H) {circumflex over (D)}^(i) contained in an inverse matrix of Equation 12 associated with the normalized value K_(m) ^(i) of the channel impulse response has a constant value in spite of an i order where phase shift keying (PSK) modulation having constant envelope characteristics is used.

[0057] However, where the QAM having the high frequency efficiency is used, the above-described inverse matrix must be produced every time the subsequent sequence estimation value is produced because ({circumflex over (D)}^(i))^(H) {circumflex over (D)}^(i) contained in an inverse matrix of the normalized value K_(m) ^(i) of the channel impulse response in Equation 12 is a function of the i^(th) sequence estimation value. When the procedure for producing the inverse matrix is implemented on the system, the system becomes unstable. In other words, it is impossible to implement the procedure for producing the inverse matrix on the system.

[0058] Thus, the present invention provides a new method for estimating the signal sequence using the EM-based iterative estimation algorithm without producing the inverse matrix associated with the i^(th) sequence estimation value when the QAM is used.

[0059]FIG. 3 is a schematic diagram illustrating a MIMO-OFDM reception system in accordance with the first embodiment of the present invention. Referring to FIG. 3, Fourier fast transform (FFT) processors 310, 311, . . . , 312 carry out FFT operations for received signals from a plurality of receiving antennas 301, 302, . . . , 303. The FFT operation signals are input into a normalizer 330, which generates a normalized value of the received signal. A pilot detection and initial value estimation unit 320 produces an initial sequence estimation value based on a predetermined initial value using a pilot sub-carrier contained in each of OFDM signals from the FFT operation signals. Outputs of the normalizer 330 and pilot detection and initial sequence estimation unit 320 are input into a sequence estimator 340 that estimates an optimum signal sequence and then generates a final sequence estimation value. The final sequence estimation value output from the sequence estimator 340 is input into an STBC decoder 350. The STBC decoder 350 performs an STBC decoding operation to generate a data symbol associated with the final sequence estimation value. The normalizer 330, the sequence estimator 340, and the STBC decoder 350 are separately configured in FIG. 3. However, in an alternate embodiment these components could be implemented as a single unit.

[0060]FIG. 4 is a flow chart illustrating a method for estimating a sequence of QAM-modulated signals on a receiving side of the MIMO-OFDM system in accordance with the first embodiment of the present invention.

[0061] Referring to FIG. 4, an initial estimation step is performed at step 410, where the pilot detection and initial value estimation unit 320 produces a repeated initial value, i.e., an initial sequence estimation value ŝ⁰, with a predetermined initial value based on a pilot sub-carrier for each OFDM symbol. The predetermined initial value can be a minimum mean square error (MMSE) estimation value or deterministic maximum likelihood (ML) estimation value.

[0062] Steps 420 to 470 correspond to expectation steps.

[0063] At step 420, the normalizer 330 extracts a p^(th) sub-carrier signal of received signals from the receiving side as shown in Equation 15.

y _(m) ^(p) =C ^(p) H _(m) ^(p) +n _(m) ^(p)  Equation 15

[0064] In Equation 15, the subscript “m” denotes an m^(th) receiving antenna, “C” denotes an arbitrary space-time block code matrix, “H” denotes a channel frequency response, and “n” denotes an additive white Gaussian noise (AWGN).

[0065] At step 430, the normalizer 330 produces a normalized value z_(m) ^(p)=[z_(1,m) ^(p), z_(2,m) ^(p), . . . , z_(N,m) ^(p)]^(T) of a received signal y_(m) ^(p) using the orthogonality of a space-time code word associated with the received signal extracted in relation to a p^(th) sub-carrier as shown in Equation 16. $\begin{matrix} \begin{matrix} {z_{m}^{p} = {\left\lbrack {\left( {\hat{C}}_{p}^{i} \right)^{H}{\hat{C}}_{p}^{i}} \right\rbrack^{- 1}\left( {\hat{C}}_{p}^{i} \right)^{H}y_{m}^{p}}} \\ {= {\frac{1}{{\hat{\beta}}_{p}^{i}}\left( {\hat{C}}_{p}^{i} \right)^{H}y_{m}^{p}}} \\ {= {H_{m}^{p} + w_{m}^{p}}} \end{matrix} & {{Equation}\quad 16} \end{matrix}$

[0066] In Equation 16, (Ĉ_(p) ^(i))^(H) Ĉ_(p) ^(i)=β_(p) ^(i)I, and w_(m) ^(p)=[w_(1,m) ^(p), w_(2,m) ^(p), . . . , w_(N,m) ^(p)]^(T). “w_(m) ^(p)” is given by the following Equation 17. $\begin{matrix} {w_{m}^{p} = {\frac{1}{{\hat{\beta}}_{p}^{i}}\left( {\hat{C}}_{p}^{i} \right)^{H}n_{m}^{p}}} & {{Equation}\quad 17} \end{matrix}$

[0067] At step 440, the normalizer 330 produces a normalized value z_(n,m) of the received signal on a channel-by-channel basis using Equation 18 by computing normalized values of received signals for the respective sub-carriers on the basis of channels 1, 2, . . . , N.

z _(n,m) =H _(n,m) +w _(n,m) =Fh _(n,m) +w _(n,m)  Equation 18

[0068] In Equation 18, w_(n,m)=[w_(n,m) ¹, w_(n,m) ², . . . , w_(n,m) ^(p)]^(T) and w_(n,m) elements are independent from each other. A covariance matrix associated with the AWGN of a channel from an n^(th) transmitting antenna to an mn receiving antenna is expressed as in Equation 19. Further, “F” denotes a discrete Fourier transform matrix, and “h_(n,m)” denotes an impulse response associated with the channel from the n^(th) transmitting antenna to the m^(th) receiving antenna.

σ_(w) ² I=ρσ _(n) ² I  Equation 19

[0069] In Equation 19, “σ_(w) ²” denotes a noise variable of the channel from the n^(th) transmitting antenna to the m^(th) receiving antenna, and “σ_(n) ²” denotes a noise variable of a signal received by the m^(th) receiving antenna. Further, “I” denotes an identity matrix, and “ρ” denotes a variance scaling factor as expressed in Equation 20. $\begin{matrix} {\rho = {E\left\lbrack \frac{\sum\limits_{i = 1}^{L}{{c_{n}(l)}}^{2}}{\beta^{2}} \right\rbrack}} & {{Equation}\quad 20} \end{matrix}$

[0070] In Equation 20, “c_(n)(l)” denotes an element of the space-time block code matrix C, and C^(H)C=βI. The variance scaling factor ρ is shown in the following Table 1. TABLE 1 Variance Scaling Factor STBC QPSK 16-QAM 64-QAM Rate 1(N = 2) 0.5  0.659 0.700 Rate ¾(N = 3, 4) 0.333 0.389 0.398 Rate ½(N = 3, 4) 0.125 0.139 0.141

[0071] The normalizer 330 produces a normalized value of the covariance matrix of the channel impulse response as shown in Equation 21 when the covariance matrix for the channel impulse response is given by R_(n,m)=E[h_(n,m)h_(n,m) ^(H)] at step 450.

K _(n,m)=(F ^(H) F+σ _(w) ² R _(n,m) ⁻¹)⁻¹  Equation 21

[0072] In Equation 21, “R” denotes the covariance matrix of the channel impulse response, and “D” denotes a symbol contained in the OFDM signal.

[0073] The normalized value of the covariance matrix of the channel impulse response as shown in Equation 21 is not expressed as a function associated with the i^(th) sequence estimation value. Further, “F” denotes a discrete Fourier transform matrix, and “R_(n,m)” denotes the covariance matrix of the channel impulse response. As long as channel covariance is not changed, the covariance matrix can be used for not only an i^(th) sequence, but also a (i+1)^(th) sequence. Thus, the normalized value K_(n,m) of the covariance matrix of the channel impulse response associated with the i^(th) sequence estimation value is produced, and the produced normalized value K_(n,m) can again be used to produce the subsequent (i+1)^(th) sequence estimation value. Subsequent sequence estimation values can be produced without producing a separate inverse matrix at each iteration time.

[0074] As shown in Equations 22 and 23 below, the sequence estimator 340 produces the conditional expected value μ_(m) ^(i) associated with the channel impulse response shown in Equation 11 above, and the conditional expected value x_(m) ^(i) associated with the covariance matrix of the channel impulse response shown Equation 13 above, at step 460.

μ_(n,m) ^(i) =K _(n,m) F ^(H) z _(n,m)  Equation 22

x _(n,m) ^(i) =σ _(w) ² K _(n,m)+μ_(n,m) ^(i)(μ_(n,m) ^(i))^(H)  Equation 23

[0075] At step 470, the sequence estimator 340 produces a likelihood function assumed under a specific probability distribution according to Equation 24. $\begin{matrix} \begin{matrix} {{L\left( s \middle| {\hat{s}}^{i} \right)} = {\sum\limits_{m = 1}^{M}{\sum\limits_{p = 1}^{P}\left\{ {{{Re}\left\lbrack {\left( y_{m}^{p} \right)^{H}\quad C_{p}\Lambda_{m}^{i}f_{p}} \right\rbrack} -} \right.}}} \\ \left. {\frac{\beta_{p}}{2}{\sum\limits_{n = 1}^{N}{\sum\limits_{a = 1}^{J}{\sum\limits_{b = 1}^{J}{{\left\lbrack x_{n,m}^{i} \right\rbrack_{a,b}\quad\left\lbrack f_{p} \right\rbrack}_{a}\quad\left\lbrack f_{p} \right\rbrack}_{b}^{*}}}}} \right\} \end{matrix} & {{Equation}\quad 24} \end{matrix}$

[0076] In Equation 24, “Λ_(m) ^(i)” denotes a matrix of a conditional expected value associated with the channel impulse response, and is given by Λ_(m) ^(i)=[μ_(1,m) ^(i), μ_(2,m) ^(i), . . . , μ_(n,m) ^(i)]^(T). “μ_(n,m) ^(i)” denotes the conditional expected value associated with the channel impulse response, and is given by μ_(n,m) ^(i)=E[h_(n,m)|y_(m), ŝ^(i)]. “[x_(n,m) ^(i)]_(a,b)” denotes a conditional expected value associated with the covariance matrix of the channel impulse response, and is given by [x_(n,m) ^(i)]_(a,b)=E[h_(n,m) ^(a)(h_(n,m) ^(b))^(H)|y_(m), ŝ^(i)]. “C” and “f” denote a space-time block code matrix and an element of a discrete Fourier transform matrix, respectively. “M”, “P”, “N”, and “J” denote the number of receiving antennas, the number of sub-carriers, the number of transmitting antennas, and the number of paths associated with the channel impulse response, respectively. Further, C^(H)C=βI.

[0077] Steps 480 to 495, described herein below, correspond to maximization steps.

[0078] At step 480, the sequence estimator 340 produces the (i+1)^(th) sequence estimation value, i.e., the subsequent sequence estimation value, shown in Equation 25 using the likelihood function of Equation 24. $\begin{matrix} {{\hat{s}}^{i + 1} = {\arg \quad {\max\limits_{s}\quad {L\left( s \middle| {\hat{s}}^{i} \right)}}}} & {{Equation}\quad 25} \end{matrix}$

[0079] At step 490, the sequence estimator 340 determines whether the subsequent sequence estimation value converges to a constant value. If the subsequent sequence estimation value converges to the constant value, step 495 is performed. Otherwise, steps 460 to 490 are repeated.

[0080] At step 495, the sequence estimator 340 determines that the sequence estimation value converged to the constant value to be a final sequence estimation value of a desired detection signal. A data symbol associated with the final sequence estimation value is then detected by the STBC decoder 350.

[0081]FIG. 5 is a graph illustrating the bit error rate (BER) performance when a space-time block code based on a rate 1 for two transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention.

[0082]FIG. 6 is a graph illustrating a BER performance when a space-time block code based on a rate ¾ for three transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention.

[0083]FIG. 7 is a graph illustrating the BER performance when a space-time block code based on a rate ¾ for four transmitting antennas and one receiving antenna is used (where f_(d)T_(s)=0.005 for 16-QAM) in accordance with the first embodiment of the present invention.

[0084] Computer simulation environments associated with FIGS. 5, 6, and 7 have been configured utilizing a physical layer standard of IEEE 802.11a. In this case, the power delay profile of a frequency selective-fading channel is shown by ${{E\left\lbrack {h_{n,m}^{a}}^{2} \right\rbrack} = {\exp \left( {- \frac{\left( {a - 1} \right)}{10}} \right)}},$

[0085] a=1, 2, . . . , J. It is assumed that each multiple path endures independent Rayleigh fading.

[0086] In accordance with the embodiment of the present invention, the initialization process and a one-time iteration process are carried out. As illustrated in FIGS. 5, 6, and 7, the BER performances indicated by reference numerals 510, 610, and 710, which are associated with the EM-based iterative estimation method being the proposed method, are better than BER performances associated with a combination-type method indicated by reference numerals 520, 620, and 720. Further, the BER performances indicated by reference numerals 510, 610, and 710, which are associated with the EM-based iterative estimation method, are substantially equal to BER performances indicated by reference numerals 530, 630, and 730, which are associated with an optimal EM method, which does not limit the number of iterations. In other words, if the iteration process is performed in accordance with the embodiment of the present invention, the BER performance converges after one or more iterations. Further, solid lines indicated by reference numerals 540, 640, and 740 denote BER performances of ideal channel information (ICI) when it is assumed that the receiving side recognizes characteristics of all channels.

[0087]FIG. 8 is a graph illustrating a mean squared error (MSE) performance when a space-time block code based on a rate 1 for two transmitting antennas and one receiving antenna is used in accordance with the first embodiment of the present invention. More specifically, FIG. 8 illustrates mean square errors (MSEs) associated with reference numerals 810 and 840 based on the combination-type method, reference numerals 820 and 850 based on the first embodiment of the present invention, and reference numerals 830 and 860 based on the optimal EM method, which does not limit the number of iterations, when a signal-to-noise ratio (SNR) is 10 dB. A horizontal axis indicates a sub-carrier number and a vertical axis indicates an MSE magnitude. Further, FIG. 8 illustrates when two transmitting antennas, i.e., a 16-QAM and an STBC based on a rate 1, are used. Curves indicated by the reference numerals 810, 820, and 830 correspond to when BT=0.005, and curves indicated by the reference numerals 840, 850, and 860 correspond to when BT=0.02. Although a one-time iteration is performed in accordance with the first embodiment of the present invention as illustrated in FIG. 8, the present invention can reduce approximately half of the MSE associated with the conventional MMSE method.

[0088]FIG. 9 is a graph illustrating an MSE performance when a space-time block code based on a rate ¾ for four transmitting antennas and one receiving antenna is used in accordance with the first embodiment of the present invention. More specifically, FIG. 9 illustrates average mean square errors (MSEs) associated with reference numerals 910 and 940 based on a combination-type method, reference numerals 920 and 950 based on the first embodiment of the present invention, reference numerals 930 and 960 based on an optimal EM method, which does not limit the number of iterations, when a signal-to-noise ratio (SNR) is 10 dB. A horizontal axis indicates an SNR value and a vertical axis indicates an average MSE value of each sub-carrier. Further, FIG. 9 illustrates when two transmitting antennas, i.e., a 16-QAM and an STBC based on a rate ¾, are used. Curves indicated by the reference numerals 910, 920, and 930 correspond to when BT=0.005, and curves indicated by the reference numerals 940, 950, and 960 correspond to when BT=0.01. Although a one-time iteration is performed in accordance with the first embodiment of the present invention as illustrated in FIG. 9, the present invention can reduce approximately half or more of the average MSE associated with the conventional MMSE method when SNR is 10 dB or more.

[0089] As illustrated in FIGS. 8 and 9, the first embodiment of the present invention can obtain an SNR gain of approximately 2˜3 dB in comparison with the conventional method. Thus, although transmission electric power is reduced by 30˜50%, a desired BER can still be obtained. Further, where original transmission electric power is used, a radius of a cell can be extended. In accordance with the first embodiment of the present invention, the system can be easily implemented because inverse matrices, which consist of rows and columns corresponding to the number of sub-carriers, do not need to be produced every time the iteration process is performed.

[0090] Second Embodiment

[0091] The second embodiment of the present invention uses a signal sequence according to an optimal expectation-maximization (EM)-based iterative estimation algorithm for a signal received through one of a plurality of receiving antennas 301, 302, . . . , 303 in a multiple-input and multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) reception system in accordance with the embodiment of the present invention illustrated in FIG. 3. The second embodiment of the present invention proposes a method capable of estimating the signal sequence without producing an inverse matrix of a sequence estimation value by employing a normalized value of the received signal at each iteration time when the signal sequence is estimated using the EM-based iterative estimation algorithm

[0092] Before the second embodiment of the present invention is described in detail, the method for estimating the signal sequence according to the EM-based iterative estimation algorithm for transmitted QAM-modulated and space-time block coded signals using one receiving antenna of the MIMO-OFDM mobile communication system will be described.

[0093] When the number of sub-carriers carrying data symbols transmitted from a transmitting side of the OFDM system is denoted by “N”, and the number of data symbols to be transmitted is denoted by “P=2N_(α)+1”, a transmission data symbol vector is expressed as in Equation 26.

s=[s(−N _(α)), . . . s(−s), s(0), s(1), . . . s(N _(α))]^(T)  Equation 26

[0094] In this case, (N-P) sub-carriers located at both edges of spectrum are not used such that aliasing associated with the sub-carriers can be prevented.

[0095] Where data is transmitted from the OFDM system, a signal y received through a frequency selective-fading channel is expressed as in Equation 27.

Y=SFh+n  Equation 27

[0096] In Equation 27, “S” denotes a diagonal matrix defined by data symbols, and is expressed as “S=diag[s(−N_(α)), . . . s(−1), s(0), s(1), . . . s(N_(α))]”. “h” denotes a channel impulse response, and is expressed as “h=[h(1), h(2), . . . h(L)]^(T)”. The notation [·]^(T) denotes a vector transpose operation. “n” denotes an AWGN vector and its average value is zero. A covariance matrix is denoted by “σ_(n) ²I”. “σ_(n) ²” denotes a noise variable, and “I” denotes an identity matrix. Further, “F” denotes a discrete Fourier transform matrix, and is expressed as in Equation 28. $\begin{matrix} {\lbrack F\rbrack_{n,k} = ^{{- j}\frac{2\quad \pi \quad {n{({k - 1})}}}{N}}} & {{Equation}\quad 28} \end{matrix}$

[0097] In Equation 28, the subscript n denotes a frequency index, and |n|≦N_(α). The subscript “k” denotes a time index, and “1≦k≦L” where L is the number of channels.

[0098] Further, a channel frequency response H=[H(−N_(α)), . . . H(−1), H(0), H(1), . . . H(N_(α)], and is expressed as in Equation 29.

H=Fh  Equation 29

[0099] The signal sequence received by the receiving side of the MIMO-OFDM mobile communication system is estimated by the EM-based iterative estimation algorithm as follows.

[0100] First, a repeated initial value, i.e., an initial sequence estimation value so, is produced according to a predetermined initial value using a pilot sub-carrier for each OFDM symbol at an initial estimation step. The predetermined initial value can be a minimum mean square error (MMSE) estimation value or deterministic maximum likelihood (ML) estimation value.

[0101] Next, a likelihood function as shown in Equation 30 is produced at an expectation step. $\begin{matrix} \begin{matrix} {{Q\left( s \middle| s^{i} \right)} = {\sum\limits_{k = {- N_{a}}}^{N_{a}}\left\{ {{{Re}\left\lbrack {{y^{*}(k)}{s(k)}\quad {\sum\limits_{l = 1}^{L}{\lbrack F\rbrack_{k,l}{m_{1}^{i}(l)}}}} \right\rbrack} -} \right.}} \\ \left. {\frac{1}{2}{s_{k}}^{2}{\sum\limits_{l = 1}^{L}{\sum\limits_{m = 1}^{L}{\lbrack F\rbrack_{k,m}^{*}{m_{2}^{i}\left( {l,m} \right)}}}}} \right\} \end{matrix} & {{Equation}\quad 30} \end{matrix}$

[0102] In the above Equation 30, “L” denotes the number of channels. “m₁ ^(i)” denotes a conditional expected value associated with the channel impulse response h where a received signal y and an i^(th) sequence estimation value s^(i) are given. The above-described “m₁ ^(i)” is expressed as in Equation 31.

m ₁ ^(i) =[m ₁ ^(i)(1), m ₁ ^(i)(2), . . . , m ₁ ^(i)(L)]^(T) =E[h|y,s ^(i) ]=R′F ^(H)(s^(i))^(*) y  Equation 31

[0103] In Equation 31, the notation (·)^(H) (a conjugated transpose) denotes a Hermitian transpose operation, the notation E[·] denotes an operation for computing an average value (or expected value), and the notation (·)* denotes a complex-conjugate operation. A normalized value R^(i) of the channel impulse response is given by Equation 32 when a covariance matrix of the channel impulse response is R_(h)=E[h h^(H)].

R ^(i)=[σ_(n) ² R _(h) ⁻¹ +F ^(H)(s ^(i))*s ^(i) F] ⁻¹  Equation 32

[0104] Further, “m₂ ^(i)” denotes a conditional expected value associated with a covariance matrix of the channel impulse response where a received signal y and an i^(th) sequence estimation value s^(i) are given. The above-described “m₂ ^(i)” is expressed as in Equation 33. $\begin{matrix} \begin{matrix} {m_{2}^{i} = \begin{bmatrix} {m_{2}^{i}\left( {1,1} \right)} & {m_{2}^{i}\left( {1,2} \right)} & \cdots & {m_{2}^{i}\left( {1,L} \right)} \\ {m_{2}^{i}\left( {2,1} \right)} & {m_{2}^{i}\left( {2,2} \right)} & \cdots & {m_{2}^{i}\left( {2,L} \right)} \\ \quad & \cdots & \quad & \quad \\ {m_{2}^{i}\left( {L,1} \right)} & {m_{2}^{i}\left( {L,2} \right)} & \cdots & {m_{2}^{i}\left( {L,L} \right)} \end{bmatrix}} \\ {= {E\left\lbrack {\left. {hh}^{H} \middle| y \right.,s^{i}} \right\rbrack}} \\ {= {{\sigma_{n}^{2}R^{\prime}} + {m_{1}^{i}\left( m_{1}^{i} \right)}^{H}}} \end{matrix} & {{Equation}\quad 33} \end{matrix}$

[0105] At a maximization step, a (i+1)^(th) sequence estimation value, i.e., a subsequent sequence estimation value, is produced by Equation 34. $\begin{matrix} {s^{i + 1} = {\arg \quad {\max\limits_{s}{Q\left( s \middle| s^{i} \right)}}}} & {{Equation}\quad 34} \end{matrix}$

[0106] A procedure of producing the subsequent sequence estimation value is repeated until the sequence estimation value converges to a constant value. If the sequence estimation value converges through the above-described procedure, the converged value is determined to be a final sequence estimation value, and then a data symbol associated with the final sequence estimation value is detected by STBC decoding.

[0107] When the signal sequence is estimated by the receiving side of the MIMO-OFDM mobile communication system using the conventional EM-based iterative estimation method, (s^(i))^(*)s^(i) is previously produced and the previously produced (s^(i))^(*)s^(i) value is used for producing the conditional expected value m₁ ^(i) of the channel impulse response, because (s^(i))^(*)s^(i) contained in an inverse matrix of Equation 32 associated with the normalized value R^(i) of the channel impulse response has a constant value despite an i order where phase shift keying (PSK) modulation having constant envelope characteristics is used.

[0108] However, when the QAM having the high frequency efficiency is used, the above-described inverse matrix must be produced every time the subsequent sequence estimation value is produced because (s^(i))^(*)s^(i) contained in an inverse matrix of the normalized value R^(i) of the channel impulse response in Equation 32 is a function of the i^(th) sequence estimation value. When the procedure of obtaining the inverse matrix is implemented on the system, the system becomes unstable. In other words, it is impossible to implement the procedure of obtaining the inverse matrix on the system.

[0109] Thus, the present invention provides a new method capable of estimating the signal sequence using the EM-based iterative estimation algorithm without producing the inverse matrix associated with the i^(th) sequence estimation value when the QAM is used.

[0110]FIG. 10 is a schematic diagram illustrating a MIMO-OFDM reception system in accordance with the second embodiment of the present invention. Referring to FIG. 10, a signal received by the receiving side is converted into a parallel signal by a serial-to-parallel converter 1010, and Fourier fast transform (FFT) processor 1020 performs an FFT operation for the parallel signal. A parallel-to-serial converter 1030 converts an FFT operation signal from the FFT processor 1020 into a serial signal. Then, the serial signal from the parallel-to-serial converter 1030 is input into a normalizer 1040. The normalizer 1040 generates a normalized value of the received signal. Then, a pilot detection and initial value estimation unit 1050 produces an initial sequence estimation value based on a predetermined initial value using a pilot sub-carrier contained in each of OFDM signals from the FFT operation signal. Then, outputs of the normalizer 1040 and pilot detection and initial sequence estimation unit 1050 are input into a sequence estimator 1060. The sequence estimator 1060 estimates an optimum signal sequence and generates a final sequence estimation value. The final sequence estimation value output from the sequence estimator 1060 is input into an STBC decoder 1070. The STBC decoder 1070 performs an STBC decoding operation to generate a data symbol associated with the final sequence estimation value. The normalizer 1040, the sequence estimator 1060, and the STBC decoder 1070 are separately configured in FIG. 10, however, in an alternate embodiment, the normalizer 1040, the sequence estimator 1060, and the STBC decoder 1070 can be implemented as a single unit.

[0111]FIG. 11 is a flow chart illustrating a method for estimating a sequence of QAM-modulated signals using one receiving antenna of the MIMO-OFDM system in accordance with the second embodiment of the present invention. In FIG. 11, step 1110 corresponds to an initial estimation step, steps 1110 to 1150 correspond to expectation steps, and steps 1160 and 1180 correspond to maximization steps.

[0112] At step 1110, the pilot detection and initial value estimation unit 1050 produces a repeated initial value, i.e., an initial sequence estimation value s⁰, with a predetermined initial value based on a pilot sub-carrier for each OFDM symbol. The predetermined initial value can be a minimum mean square error (MMSE) estimation value or deterministic maximum likelihood (ML) estimation value. At step 1120, the normalizer 1040 produces a normalized value y′ of the received signal using an i^(th) sequence estimation value s^(i) as in Equation 35.

y′=(s ^(i))⁻¹ y=Fh=n′  Equation 35

[0113] In Equation 35, n′=(s^(i))⁻¹n . It is assumed that “n′” is a channel white Gaussian noise as in Equation 36. $\begin{matrix} {\sigma_{n^{\prime}}^{2} = {{\frac{1}{M}{\sum\limits_{m = 1}^{M}\frac{\sigma_{n}^{2}}{{s_{m}}^{2}}}} = {\beta \quad \sigma_{n}^{2}}}} & {{Equation}\quad 36} \end{matrix}$

[0114] In Equation 36, “s_(m)” denotes an m^(th) symbol based on M-ary QAM, and σ_(n) ² denotes a noise variable. Further, “β” denotes a variance scaling factor. β=1 for PSK, β=1.998 for 16-QAM, and β=2.6854 for 64-QAM.

[0115] At step 1130, the normalizer 1040 obtains a normalized value of a covariance matrix of the channel impulse response as in Equation 37 when a covariance matrix of the channel impulse response is given by R_(h)=E[h h^(H)].

(R′)^(i)=[σ_(n′) ² R _(h) ⁻¹ +F ^(H) F] ⁻¹  Equation 37

[0116] In Equation 37, the normalized value of the covariance matrix of the channel impulse response is not expressed as a function of the i^(th) sequence estimation value. Further. “F” denotes a discrete Fourier transform matrix, and “R_(h)” denotes the covariance matrix for the channel impulse response. As long as channel covariance is not changed, the covariance matrix can be used for an i^(th) sequence, and also a (i+1)^(th) sequence. Thus, the normalized value (R′)^(i) of the covariance matrix of the channel impulse response associated with the i^(th) sequence estimation value is produced, and the produced normalized value (R′)^(i) can be again used for producing the subsequent (i+1)^(th) sequence estimation value. Subsequent sequence estimation values can be produced without producing a separate inverse matrix at each iteration time.

[0117] As shown in Equations 38 and 39 below, the sequence estimator 1060 produces the conditional expected value m₁ ^(i) associated with the channel impulse response as shown Equation 31, and the conditional expected value m₂ ^(i) associated with a covariance matrix of the channel impulse response as shown in Equation 33 above, at step 1140.

m ₁ ^(i) =[m ₁ ^(i)(1), m ₁ ^(i)(2), . . . , m₁ ^(i)(L)]^(T) =E[h|y, s ^(i)]=(R′)^(i) F ^(H) y  Equation 38 $\begin{matrix} \begin{matrix} {m_{2}^{i} = \begin{bmatrix} {m_{2}^{i}\left( {1,1} \right)} & {m_{2}^{i}\left( {1,2} \right)} & \cdots & {m_{2}^{i}\left( {1,L} \right)} \\ {m_{2}^{i}\left( {2,1} \right)} & {m_{2}^{i}\left( {2,2} \right)} & \cdots & {m_{2}^{i}\left( {2,L} \right)} \\ \quad & \cdots & \quad & \quad \\ {m_{2}^{i}\left( {L,1} \right)} & {m_{2}^{i}\left( {L,2} \right)} & \cdots & {m_{2}^{i}\left( {L,L} \right)} \end{bmatrix}} \\ {= {E\left\lbrack {\left. {hh}^{H} \middle| y \right.,s^{i}} \right\rbrack}} \\ {= {{\sigma_{n}^{2}\left( R^{\prime} \right)}^{i} + {m_{1}^{i}\left( m_{1}^{i} \right)}^{H}}} \end{matrix} & {{Equation}\quad 39} \end{matrix}$

[0118] At step 1150, the sequence estimator 1060 obtains a likelihood function assumed under a specific probability distribution according to Equation 40. $\begin{matrix} \begin{matrix} {{Q\left( s \middle| s^{i} \right)} = {\sum\limits_{k = {- N_{a}}}^{N_{a}}\left\{ {{{Re}\left\lbrack {{y^{*}(k)}{s(k)}\quad {\sum\limits_{l = 1}^{L}{\lbrack F\rbrack_{k,l}{m_{1}^{i}(l)}}}} \right\rbrack} -} \right.}} \\ \left. {\frac{1}{2}{s_{k}}^{2}{\sum\limits_{l = 1}^{L}{\sum\limits_{m = 1}^{L}{{\lbrack F\rbrack_{k,l}\lbrack F\rbrack}_{k,m}^{*}{m_{2}^{i}\left( {l,m} \right)}}}}} \right\} \end{matrix} & {{Equation}\quad 40} \end{matrix}$

[0119] At step 1160, the sequence estimator 1060 produces the (i+1)^(th) sequence estimation value, i.e., the subsequent sequence estimation value, shown in the following Equation 41 using the likelihood function of Equation 40. $\begin{matrix} {s^{i + 1} = {\arg \quad {\max\limits_{s}\quad {Q\left( s \middle| s^{i} \right)}}}} & {{Equation}\quad 41} \end{matrix}$

[0120] At step 1170, the sequence estimator 1060 determines whether the subsequent sequence estimation value converge to a constant value. If the subsequent sequence estimation value converges to the constant value, step 1180 is performed. Otherwise, the above steps 1140 to 1170 are repeated.

[0121] At step 1180, the sequence estimator 1060 determines that the sequence estimation value, converged to the constant value, to be a final sequence estimation value of a desired detection signal. A data symbol associated with the final sequence estimation value is then detected by the STBC decoder 1070.

[0122]FIG. 12 is a graph illustrating the BER performance according to a method for detecting a received signal in the case of 16-QAM in accordance with the second embodiment of the present invention, and FIG. 13 is a graph illustrating the BER performance according to a method for detecting a received signal in the case of 64-QAM in accordance with the second embodiment of the present invention. Computer simulation environments associated with FIGS. 12 and 13 have been configured utilizing a physical layer standard of IEEE 802.11a. In this case, the power delay profile of a frequency selective-fading channel is ${{E\left\lbrack {{h(i)}}^{2} \right\rbrack} = {\exp \left( {- \frac{\left( {i - 1} \right)}{10}} \right)}},{i = 1},2,\cdots \quad,{L.}$

[0123] i=1, 2 , . . . , L. It is assumed that each of multiple paths endures independent Rayleigh fading.

[0124] In accordance with the second embodiment of the present invention, the initialization process and a one-time iteration process are performed. As illustrated in FIGS. 12 and 13, BER performances indicated by reference numerals 1210 and 1310, which are associated with the EM-based iterative estimation method being the proposed method, are better than BER performances associated with a combination-type method indicated by reference numerals 1220 and 1320. Further, the BER performances indicated by the reference numerals 1210 and 1310, which are associated with the EM-based iterative estimation method, are substantially equal to the BER performances indicated by the reference numerals 1220 and 1320 that are associated with an optimal EM method, which does not limit the number of iterations. In other words, if the iteration process is performed in accordance with the second embodiment of the present invention, the BER performance converges after one or more iterations. Additionally, solid lines indicated by reference numerals 1240 and 1340 denote BER performances of ideal channel information (ICI) when it is assumed that the receiving side correctly recognizes characteristics of all channels.

[0125]FIG. 14 is a graph illustrating the improved MSE performance based on an iterative procedure in accordance with the second embodiment of the present invention. More particularly, FIG. 14 illustrates mean square errors (MSEs) associated with a reference numeral 1410 based on a combination-type method, reference numerals 1420, 1430, and 1440 based on the second embodiment of the present invention, and a reference numeral 1450 based on the optimal EM method, which does not limit the number of iterations, when a signal-to-noise ratio (SNR) is 10 dB. A horizontal axis indicates a sub-carrier number and a vertical axis indicates an MSE magnitude. Although a one-time iteration is performed in accordance with the second embodiment of the present invention, as illustrated in FIG. 14, the present invention can reduce approximately half of the MSE associated with the conventional MMSE method. In accordance with the embodiment of the present invention, a curve 1420, which corresponds to two iterations, and a curve 1430, which corresponds to three iterations, overlap each other in FIG. 14.

[0126]FIG. 15 is a graph illustrating the improved average MSE performance based on an iterative procedure in accordance with the second embodiment of the present invention. More specifically, FIG. 15 illustrates average mean square errors (MSEs) associated with a reference numeral 1510 based on a combination-type method, reference numerals 1520, 1530, and 1540 based on the second embodiment of the present invention, and a reference numeral 1550 based on the optimal EM method, which does not limit the number of iterations, when a signal-to-noise ratio (SNR) is 10 dB. A horizontal axis indicates an SNR value and a vertical axis indicates an average MSE value of each sub-carrier. Although a one-time iteration is performed in accordance with the second embodiment of the present, as illustrated in FIG. 15, the present invention can reduce approximately half or more of an average MSE associated with the conventional MMSE method when SNR is 10 dB or more. In particular, where the SNR is greater than 20 dB, the MSE in accordance with the second embodiment of the present invention is close to the MSE 1550 based on the optimal EM method, which does not limit the number of iterations. In accordance with the second embodiment of the present invention, a curve 1520, which corresponds to two iterations, and a curve 1530, which corresponds to three iterations, overlap each other in FIG. 15.

[0127] As illustrated in FIGS. 14 and 15, the second embodiment of the present invention can obtain an SNR gain of approximately 2˜3 dB in comparison with the conventional method. Thus, although transmission electric power is reduced by 30˜50%, a desired BER can still be obtained. Further, where original transmission electric power is used, a radius of a cell can be extended. In accordance with the second embodiment of the present invention, the system can be easily implemented because inverse matrices consisting of rows and columns, which correspond to the number of sub-carriers, do not need to be produced every time the iteration process is performed.

[0128] As described above, the present invention provides an improved performance-based channel estimation method, compared to the conventional MMSE method, thereby obtaining a desired BER with low transmission electric power, and extending a radius of a cell.

[0129] Further, the present invention improves channel estimation performance associated with QAM signal detection in comparison with the conventional MMSE estimation method and can be easily implemented because an inverse matrix does not need to be produced.

[0130] Although preferred embodiments of the present invention have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, without departing from the scope of the invention. Therefore, the present invention is not limited to the above-described embodiments, but the present invention is defined by the claims that follow, along with their full scope of equivalents. 

What is claimed is:
 1. A method for estimating a sequence of transmitted quadrature amplitude modulation (QAM)-modulated signals and space-time block coded signals using an optimal expectation-maximization (EM)-based iterative estimation algorithm in a multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) mobile communication system, comprising the steps of: (a) producing an initial sequence estimation value according to a predetermined initial value using a pilot sub-carrier contained in each OFDM signal received by a receiving side; (b) producing a normalized value of a received signal on a channel-by-channel basis using orthogonality between the OFDM signals received by the receiving side, the normalized value of the received signal being produced by a predetermined equation; (c) producing at least one subsequent sequence estimation value using the initial sequence estimation value and the normalized value of the received signal on the channel-by-channel basis; and (d) if the at least one subsequent sequence estimation value converges to a constant value, designating the converged subsequent sequence estimation value to be a final sequence estimation value, wherein the predetermined equation is given by: z _(n,m) =H _(n,m) +w _(n,m) =Fh _(n,m) +w _(n,m) where “w_(n,m)” denotes a white Gaussian noise of a channel from an n^(th) transmitting antenna to an m^(th) receiving antenna, “F” denotes a discrete Fourier transform matrix, and “h_(n,m)” denotes an impulse response associated with the channel from the n^(th) transmitting antenna to the m^(th) receiving antenna.
 2. The method as set forth in claim 1, wherein the at least one subsequent sequence estimation value produced in step (c) is produced on according to a likelihood function produced by: ${L\left( s \middle| {\hat{s}}^{i} \right)} = {\sum\limits_{m = 1}^{M}\quad {\sum\limits_{p = 1}^{P}\quad \left\{ {{{Re}\left\lbrack {\left( y_{m}^{p} \right)^{H}C_{p}\Lambda_{m}^{i}f_{p}} \right\rbrack} - {\frac{\beta_{p}}{2}{\sum\limits_{n = 1}^{N}\quad {\sum\limits_{a = 1}^{J}\quad {\sum\limits_{b = 1}^{J}\quad {{\left\lbrack x_{n,m}^{i} \right\rbrack_{a,b}\quad\left\lbrack f_{p} \right\rbrack}_{a}\left\lbrack f_{p} \right\rbrack}_{b}^{*}}}}}} \right\}}}$

where “Λ_(m) ^(i)” denotes a matrix of a conditional expected value associated with a channel impulse response and is given by Λ_(m) ^(i)=[μ_(1,m) ^(i), μ_(2,m) ^(i), . . . , μ_(n,m) ^(i)]^(T), “μ_(n,m) ^(i)” denotes the conditional expected value associated with the channel impulse response and is given by μ_(n,m) ^(i)=E[h_(n,m)|y_(m), ŝ^(i)], “[x_(n,m) ^(i)]_(a,b)” denotes a conditional expected value associated with a covariance matrix of the channel impulse response and is given by [x_(n,m) ^(i)]_(a,b)=E[h_(n,m) ^(a)(h_(n,m) ^(b))^(H)|y_(m)ŝ^(i)], “C” denotes a space-time block code matrix, “f” denotes an element of a discrete Fourier transform matrix, “M” denotes the number of receiving antennas, “P” denotes the number of sub-carriers, “N” denotes the number of transmitting antennas, “J” denotes the number of paths associated with the channel impulse response, and C^(H)C=μI.
 3. The method as set forth in claim 1, wherein the white Gaussian noise is associated with the covariance matrix produced by: σ_(w) ² I=ρσ _(n) ² I where “σ_(w) ²” denotes a noise variable of the channel from the n^(th) transmitting antenna to the m^(th) receiving antenna, “σ_(n) ²” denotes a noise variable of a signal received by the m^(th) receiving antenna, “I” denotes an identity matrix, and “ρ” denotes a variance scaling factor.
 4. The method as set forth in claim 3, wherein the variance scaling factor is produced by: $\rho = {E\left\lbrack \frac{\sum\limits_{i = 1}^{L}\quad {{c_{n}(l)}}^{2}}{\beta^{2}} \right\rbrack}$

where “c_(n)(l)” denotes an element of a space-time block code matrix C, and C^(H)C=μI.
 5. The method as set forth in claim 3, wherein the variance scaling factor is produced by: STBC 16-QAM 64-QAM Rate 1(N = 2) 0.659 0.700 Rate ¾(N = 3, 4) 0.389 0.398 Rate ½(N = 3, 4) 0.139 0.141


6. The method as set forth in claim 2, wherein the conditional expected value associated with the channel impulse response is produced by: μ_(n,m) ^(i) =K _(n,m) F ^(H) z _(n,m) where “K_(n,m)” denotes a normalized value of the covariance matrix of the channel impulse response, and “(·)^(H)” denotes a Hermitian transpose operation.
 7. The method as set forth in claim 2, wherein the conditional expected value associated with the covariance matrix of the channel impulse response is produced by: x _(n,m) ^(i) =σ _(w) ² K _(n,m)+μ_(n,m) ^(i)(μ_(n,m) ^(i))^(H) where “K_(n,m)” denotes a normalized value of the covariance matrix of the channel impulse response, and “(·)^(H) 38 denotes a Hermitian transpose operation.
 8. The method as set forth in claim 6, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: K _(n,m)=(F ^(H) F+σ _(w) ² R _(n,m) ⁻¹)⁻¹ where “R” denotes the covariance matrix of the channel impulse response.
 9. The method as set forth in claim 7, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: K _(n,m)=(F ^(H) F+σ _(w) ² R _(n,m) ⁻¹)⁻¹ where “R” denotes the covariance matrix of the channel impulse response.
 10. An apparatus for estimating a sequence of transmitted quadrature amplitude modulation (QAM)-modulated signals and space-time block coded signals using an optimal expectation-maximization (EM)-based iterative estimation algorithm in a multiple-input and multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) mobile communication system, comprising: a pilot detection and initial value estimation unit for producing an initial sequence estimation value according to a predetermined initial value using a pilot sub-carrier contained in each OFDM signal received by a receiving side; a normalizer for producing a normalized value of a received signal on a channel-by-channel basis using orthogonality between the OFDM signals received by the receiving side, the normalized value of the received signal being produced by a predetermined equation; and a sequence estimator for producing at least one subsequent sequence estimation value using the initial sequence estimation value and the normalized value, and designating a converged subsequent sequence estimation value to be a final sequence estimation value if the at least one subsequent sequence estimation value converges to a constant value, wherein the predetermined equation is given by: z _(n,m) =H _(n,m) +w _(n,m) =Fh _(n,m) +w _(n,m) where “w_(n,m)” denotes a white Gaussian noise of a channel from an n^(th) transmitting antenna to an m^(th) receiving antenna, “F” denotes a discrete Fourier transform matrix, and “h_(n,m)” denotes an impulse response associated with the channel from the n^(th) transmitting antenna to the m^(th) receiving antenna
 11. The apparatus as set forth in claim 10, wherein the at least one subsequent sequence estimation value is produced according to a likelihood function produced by: ${L\left( s \middle| {\hat{s}}^{i} \right)} = {\sum\limits_{m = 1}^{M}\quad {\sum\limits_{p = 1}^{P}\quad \left\{ {{{Re}\left\lbrack {\left( y_{m}^{p} \right)^{H}C_{p}\Lambda_{m}^{i}f_{p}} \right\rbrack} - {\frac{\beta_{p}}{2}{\sum\limits_{n = 1}^{N}\quad {\sum\limits_{a = 1}^{J}\quad {\sum\limits_{b = 1}^{J}\quad {{\left\lbrack x_{n,m}^{i} \right\rbrack_{a,b}\quad\left\lbrack f_{p} \right\rbrack}_{a}\left\lbrack f_{p} \right\rbrack}_{b}^{*}}}}}} \right\}}}$

where “Λ_(m) ^(i)” denotes a matrix of a conditional expected value associated with a channel impulse response and is given by Λ_(m) ^(i)=[μ_(1,m) ^(i), μ_(2,m) ^(i), . . . , μ_(n,m) ^(i)]^(T), “μ_(n,m) ^(i)” denotes the conditional expected value associated with the channel impulse response and is given by μ_(n,m) ^(i)=E[h_(n,m)|y_(m), ŝ^(i)], “[x_(n,m) ^(i)]_(a,b)” denotes a conditional expected value associated with a covariance matrix of the channel impulse response and is given by [x_(n,m) ^(i)]_(a,b)=E[h_(n,m) ^(a)(h_(n,m) ^(b))^(H)|y_(m), ŝ^(i)], “C” denotes a space-time block code matrix, “f” denotes an element of a discrete Fourier transform matrix, “M” denotes the number of receiving antennas, “P” denotes the number of sub-carriers, “N” denotes the number of
 12. The apparatus as set forth in claim 10, wherein the white Gaussian noise is associated with the covariance matrix produced by: σ_(w) ² I=ρσ _(n) ² I where “σ_(w) ²” denotes a noise variable of a channel from the n^(th) transmitting antenna to the m^(th) receiving antenna, “σ_(n) ²” denotes a noise variable of a signal received by the m^(th) receiving antenna, “I” denotes an identity matrix, and “ρ” denotes a variance scaling factor.
 13. The apparatus as set forth in claim 12, wherein the variance scaling factor is produced by: $\rho = {E\left\lbrack \frac{\sum\limits_{i = 1}^{L}\quad {{c_{n}(l)}}^{2}}{\beta^{2}} \right\rbrack}$

where “c_(n)(l)” denotes an element of a space-time block code matrix C, and C^(H)C=βI.
 14. The apparatus as set forth in claim 12, wherein the variance scaling factor is produced by: STBC 16-QAM 64-QAM Rate 1(N = 2) 0.659 0.700 Rate ¾(N = 3, 4) 0.389 0.398 Rate ½(N = 3, 4) 0.139 0.141


15. The apparatus as set forth in claim 11, wherein the conditional expected value associated with the channel impulse response is produced by: μ_(n,m) ^(i) =K _(n,m) F ^(H) z _(n,m) where “K_(n,m)” denotes a normalized value of the covariance matrix of the channel impulse response, and “(·)^(H)” denotes a Hermitian transpose operation.
 16. The apparatus as set forth in claim 11, wherein the conditional expected value associated with the covariance matrix of the channel impulse response is produced by: x _(n,m) ^(i) =σ _(w) ² K _(n,m)+μ_(n,m) ^(i)(μ_(n,m) ^(i))^(H) where “K_(n,m)” denotes a normalized value of the covariance matrix of the channel impulse response, and “(·)^(H)” denotes a Hermitian transpose operation.
 17. The apparatus as set forth in claim 15, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: K _(n,m)=(F ^(H) F+σ _(w) ² R _(n,m) ⁻¹)⁻¹ where “R” denotes the covariance matrix of the channel impulse response.
 18. The apparatus as set forth in claim 16, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: K _(n,m)=(F ^(H) F+σ _(w) ² R _(n,m) ⁻¹)⁻¹ where “R” denotes the covariance matrix of the channel impulse response.
 19. A method for estimating a sequence of transmitted quadrature amplitude modulation (QAM)-modulated signals though an optimal expectation-maximization (EM)-based iterative estimation algorithm using one receiving antenna of a multiple-input and multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) mobile communication system, comprising the steps of: (a) producing an initial sequence estimation value according to a predetermined initial value using a pilot sub-carrier contained in each OFDM signal received by the receiving antenna; (b) producing a normalized value of a received signal using the initial sequence estimation value, the normalized value of the received signal being produced by a predetermined equation; (c) producing at least one subsequent sequence estimation value using the initial sequence estimation value and the normalized value of the received signal; and (d) if the at least one subsequent sequence estimation value converges to a constant value, designating the converged subsequent sequence estimation value to be a final sequence estimation value, wherein the predetermined equation is given by: y′=(s ^(i))⁻¹ y=Fh+n′ where “F” denotes a discrete Fourier transform matrix, “h” denotes a channel impulse response, and “n′” denotes a channel white Gaussian noise.
 20. The method as set forth in claim 19, wherein the at least one subsequent sequence estimation value produced step (c) is produced according to a likelihood function produced by: ${Q\left( s \middle| s^{i} \right)} = {\sum\limits_{k = {- N_{a}}}^{N_{a}}\quad \left\{ {{{Re}\left\lbrack {{y^{*}(k)}{s(k)}{\sum\limits_{l = 1}^{L}\quad {\lbrack F\rbrack_{k,l}{m_{1}^{i}(l)}}}} \right\rbrack} - {\frac{1}{2}{s_{k}}^{2}{\sum\limits_{l = 1}^{L}\quad {\sum\limits_{m = 1}^{L}\quad {{\lbrack F\rbrack_{k,l}\lbrack F\rbrack}_{k,m}^{*}{m_{2}^{i}\left( {l,m} \right)}}}}}} \right\}}$

where “F” denotes a discrete Fourier transform matrix, “m₁ ^(i)” denotes a conditional expected value associated with the channel impulse response, “m₂ ^(i)”denotes a conditional expected value associated with a covariance matrix of the channel impulse response, and “L” denotes a number of channels.
 21. The method as set forth in claim 19, wherein the white Gaussian noise is produced by: $\sigma_{n^{\prime}}^{2} = {{\frac{1}{M}{\sum\limits_{m = 1}^{M}\quad \frac{\sigma_{n}^{2}}{{s_{m}}^{2}}}} = {\beta \quad \sigma_{n}^{2}}}$

where “s_(m)” denotes an m^(th) symbol based on M-ary QAM, “β” denotes a variance scaling factor, and “σ_(n) ²” denotes a noise variable.
 22. The method as set forth in claim 21, wherein the variance scaling factor is β=1.998 for 16-QAM.
 23. The method as set forth in claim 21, wherein the variance scaling factor is β=2.6854 for 64-QAM.
 24. The method as set forth in claim 20, wherein the conditional expected value associated with the channel impulse response is produced by: m ₁ ^(i) =[m ₁ ^(i)(1), m ₁ ^(i)(2), . . . , m₁ ^(i)(L)]^(T) =E[h|y, s ^(i)]=(R′)^(i) F ^(H) y where (·)^(H)” denotes a Hermitian transpose operation, and “R′” denotes a normalized value of a covariance matrix of the channel impulse response.
 25. The method as set forth in claim 20, wherein a normalized value of the covariance matrix of the channel impulse response is produced by: $\begin{matrix} {m_{2}^{i} = \begin{bmatrix} {m_{2}^{i}\left( {1,1} \right)} & {m_{2}^{i}\left( {1,2} \right)} & \cdots & {m_{2}^{i}\left( {1,L} \right)} \\ {m_{2}^{i}\left( {2,1} \right)} & {m_{2}^{i}\left( {2,2} \right)} & \cdots & {m_{2}^{i}\left( {2,L} \right)} \\ \quad & \quad & \cdots & \quad \\ {m_{2}^{i}\left( {L,1} \right)} & {m_{2}^{i}\left( {L,1} \right)} & \cdots & {m_{2}^{i}\left( {L,L} \right)} \end{bmatrix}} \\ {= {E\left\lbrack {\left. {hh}^{H} \middle| y \right.,s^{i}} \right\rbrack}} \\ {= {{\sigma_{n}^{2}\left( R^{\prime} \right)}^{i} + {m_{1}^{i}\left( m_{1}^{i} \right)}^{H}}} \end{matrix}$

where “(·)^(H)” denotes a Hermitian transpose operation, and “R′” denotes a normalized value of the covariance matrix of the channel impulse response.
 26. The method as set forth in claim 24, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: (R′)^(i)=[σ_(n′) ² , R _(h) ⁻¹ +F ^(H) F] ⁻¹ where “R_(h)” denotes the covariance matrix of the channel impulse response.
 27. The method as set forth in claim 25, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: (R′)^(i)=[σ_(n′) ² , R _(h) ⁻¹ +F ^(H) F] ⁻¹ where “R_(h)” denotes the covariance matrix of the channel impulse response.
 28. An apparatus for estimating a sequence of transmitted quadrature amplitude modulation (QAM)-modulated signals though an optimal expectation-maximization (EM)-based iterative estimation algorithm using one receiving antenna of a multiple-input and multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) mobile communication system, comprising: a pilot detection and initial value estimation unit for producing an initial sequence estimation value according to a predetermined initial value using a pilot sub-carrier contained in each OFDM signal received by a receiving side; a normalizer for producing a normalized value of a received signal using the initial sequence estimation value, the normalized value of the received signal being produced by a predetermined equation; and a sequence estimator for producing at least one subsequent sequence estimation value using the initial sequence estimation value and the normalized value, and designating a converged subsequent sequence estimation value to be a final sequence estimation value if the at least one subsequent sequence estimation value converges to a constant value, wherein the predetermined equation is: y′=(s ^(i))⁻¹ y=Fh+n′ where “F” denotes a discrete Fourier transform matrix, “h” denotes a channel impulse response, and “n′” denotes a channel white Gaussian noise.
 29. The apparatus as set forth in claim 28, wherein the at least one subsequent sequence estimation value is produced according to a likelihood function produced by: ${Q\left( s \middle| s^{i} \right)} = {\sum\limits_{k = {- N_{a}}}^{N_{a}}\quad \left\{ {{{Re}\left\lbrack {{y^{*}(k)}{s(k)}{\sum\limits_{l = 1}^{L}\quad {\lbrack F\rbrack_{k,l}{m_{1}^{i}(l)}}}} \right\rbrack} - {\frac{1}{2}{s_{k}}^{2}{\sum\limits_{l = 1}^{L}\quad {\sum\limits_{m = 1}^{L}\quad {{\lbrack F\rbrack_{k,l}\lbrack F\rbrack}_{k,m}^{*}{m_{2}^{i}\left( {l,m} \right)}}}}}} \right\}}$

where “F” denotes the discrete Fourier transform matrix, “m₁ ^(i)” denotes a conditional expected value associated with the channel impulse response, “m₂ ^(i)” denotes a conditional expected value associated with a covariance matrix of the channel impulse response, and “L” denotes the number of channels.
 30. The apparatus as set forth in claim 28, wherein the white Gaussian noise is produced by: $\sigma_{n^{\prime}}^{2} = {{\frac{1}{M}{\sum\limits_{m = 1}^{M}\quad \frac{\sigma_{n}^{2}}{{s_{m}}^{2}}}} = {\beta\sigma}_{n}^{2}}$

where “s_(m)” denotes an m^(th) symbol based on M-ary QAM, “β” denotes a variance scaling factor, and “σ_(n) ²” denotes a noise variable.
 31. The apparatus as set forth in claim 30, wherein the variance scaling factor is β=1.998 for 16-QAM.
 32. The apparatus as set forth in claim 30, wherein the variance scaling factor is β=2.6854 for 64-QAM.
 33. The apparatus as set forth in claim 29, wherein the conditional expected value associated with the channel impulse response is produced by: m ₁ ^(i) =[m ₁ ^(i)(1), m ₁ ^(i)(2), . . . , m₁ ^(i)(L)]^(T) =E[h|y, s ^(i)]=(R′)^(i) F ^(H) y where “(·)^(H)” denotes a Hermitian transpose operation, and “R′” denotes a normalized value of the covariance matrix of the channel impulse response.
 34. The apparatus as set forth in claim 29, wherein a normalized value of the covariance matrix of the channel impulse response is produced by an equation of $m_{2}^{i} = {\begin{bmatrix} {m_{2}^{i}\left( {1,1} \right)} & {m_{2}^{i}\left( {1,2} \right)} & \ldots & {m_{2}^{i}\left( {1,L} \right)} \\ {m_{2}^{i}\left( {2,1} \right)} & {m_{2}^{i}\left( {2,2} \right)} & \ldots & {m_{2}^{i}\left( {2,L} \right)} \\ \quad & \quad & \ldots & \quad \\ {m_{2}^{i}\left( {L,1} \right)} & {m_{2}^{i}\left( {L,2} \right)} & \ldots & {m_{2}^{i}\left( {L,L} \right)} \end{bmatrix} = {{E\left\lbrack {{{hh}^{H}y},s^{i}} \right\rbrack} = {{\sigma_{n}^{2}\left( R^{\prime} \right)}^{i} + {m_{1}^{i}\left( m_{1}^{i} \right)}^{H}}}}$

where “(·)^(H)” denotes a Hermitian transpose operation, and “R′” denotes a normalized value of the covariance matrix of the channel impulse response.
 35. The apparatus as set forth in claim 33, wherein a normalized value of the covariance matrix of the channel impulse response is produced by an equation of: (R′)^(i) =[σ _(n′) ² R _(h) ⁻¹ +F ^(H) F] ⁻¹ where “R_(h)” denotes the covariance matrix of the channel impulse response.
 36. The apparatus as set forth in claim 34, wherein the normalized value of the covariance matrix of the channel impulse response is produced by: (R′)^(i)=[σ_(n′) ² R _(h) ⁻¹ +F ^(H) F] ¹ where “R_(h)” denotes the covariance matrix of the channel impulse response. 